On Cache Replacement Policies for Servicing Mixed Data Intensive Query Workloads
نویسندگان
چکیده
When data analysis applicationsare employed in a multiclient environment, a data server must service multiple simultaneous queries, each of which may employ complex user-defined data structures and operations on the data. It is then necessary to harness interand intra-query commonalitiesand system resources to improve the performance of the data server. We have developed a framework and customizable middleware to enable reuse of intermediate and final results among queries, through an in-memory active semantic cache and user-defined transformation functions. Since resources such as processing power and memory space are limited on the machine hosting the server, effective scheduling of incoming queries and efficient cache replacement policies are challenging issues that must be addressed. We have worked on the scheduling problem in earlier work, and in this paper we describe and evaluate several cache replacement policies. We present experimental evaluation of the policies on a shared-memory parallel system using two applications from different application domains.
منابع مشابه
Accurate Modeling of Cache Replacement Policies in a Data Grid
Caching techniques have been used to improve the performance gap of storage hierarchies in computing systems. In data intensive applications that access large data files over wide area network environment, such as a data grid, caching mechanism can significantly improve the data access performance under appropriate workloads. In a data grid, it is envisioned that local disk storage resources re...
متن کاملSemantic Data Caching and Replacement
We propose a semantic model for client-side caching and replacement in a client-server database system and compare this approach to page caching and tuple caching strategies. Our caching model is based on, and derives its advantages from, three key ideas. First, the client maintains a semantic description of the data in its cache,which allows for a compact specification, as a remainder query, o...
متن کاملOn the Performance of Heterogeneous Web Proxy Caching Hierarchies
This paper uses trace-driven simulations to evaluate the performance of three different cache management techniques for multi-level Web caching hierarchies. In particular, the experiments consider heterogeneous cache replacement policies, size-based partitioning, and sharingbased partitioning across the levels of a two-level caching hierarchy. Three different synthetic Web proxy workloads are u...
متن کاملSimulation Evaluation of a Heterogeneous Web Proxy Caching Hierarchy
This paper uses trace-driven simulations to evaluate the performance of different cache management techniques for multi-level Web proxy caching hierarchies. In particular, the experiments consider heterogeneous cache replacement policies within a two-level caching hierarchy, and sizebased partitioning across the levels of a caching hierarchy. Three different synthetic Web proxy workloads are us...
متن کاملARC: A Self-Tuning, Low Overhead Replacement Cache
We consider the problem of cache management in a demand paging scenario with uniform page sizes. We propose a new cache management policy, namely, Adaptive Replacement Cache (ARC), that has several advantages. In response to evolving and changing access patterns, ARC dynamically, adaptively, and continually balances between the recency and frequency components in an online and selftuning fashio...
متن کامل